Improved Mixing Time Bounds for the Thorp Shuffle
نویسنده
چکیده
E. Thorp introduced the following card shuffling model. Suppose the number of cards n is even. Cut the deck into two equal piles. Drop the first card from the left pile or from the right pile according to the outcome of a fair coin flip. Then drop from the other pile. Continue this way until both piles are empty. We show that if n is a power of 2 then the mixing time of the Thorp shuffle is O(log n). Previously, the best known bound was O(log n).
منابع مشابه
Mixing time bounds for overlapping cycles shuffles
Consider a deck of n cards. Let p1, p2, . . . , pn be a probability vector and consider the mixing time of the card shuffle which at each step of time picks a position according to the pi’s and move the card in that position to the top. This setup was introduced in [5], where a few special cases were studied. In particular the case pn−k = pn = 1/2, k = Θ(n), turned out to be challenging and onl...
متن کاملAnalysis of Top to Bottom - K Shuffles 3
A deck of n cards is shuffled by repeatedly moving the top card to one of the bottom kn positions uniformly at random. We give upper and lower bounds on the total variation mixing time for this shuffle as kn ranges from a constant to n. We also consider a symmetric variant of this shuffle in which at each step either the top card is randomly inserted into the bottom kn positions or a random car...
متن کاملMathematical Aspects of Mixing Times in Markov Chains
In the past few years we have seen a surge in the theory of finite Markov chains, by way of new techniques to bounding the convergence to stationarity. This includes functional techniques such as logarithmic Sobolev and Nash inequalities, refined spectral and entropy techniques, and isoperimetric techniques such as the average and blocking conductance and the evolving set methodology. We attemp...
متن کاملDuality and evolving set bounds on mixing times
We sharpen the Evolving set methodology of Morris and Peres and extend it to study convergence in total variation, relative entropy, L2 and other distances. Bounds in terms of a modified form of conductance are given which apply even for walks with no holding probability. These bounds are found to be strictly better than earlier Evolving set bounds, may be substantially better than conductance ...
متن کاملMixing times for the interchange process
Consider the interchange process on a connected graph G = (V,E) on n vertices. I.e. shuffle a deck of cards by first placing one card at each vertex of G in a fixed order and then at each tick of the clock, picking an edge uniformly at random and switching the two cards at the end vertices of the edge with probability 1/2. Well known special cases are the random transpositions shuffle, where G ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 22 شماره
صفحات -
تاریخ انتشار 2013